Zero Sums in Finite Cyclic Groups
نویسنده
چکیده
Let Cn be the cyclic group of n elements, and let S = (a1, · · · , ak) be a sequence of elements in Cn. We say that S is a zero sequence if ∑k i=1 ai = 0 and that S is a minimal zero-sequence if S is a zero sequence and S contains no proper zero subsequence. In this paper we prove, among other results, that if S is a minimal zero sequence of elements in Cn and |S| ≥ n − [ 3 ] + 1, then there exists an integer m coprime to n such that |ma1|+ · · ·+ |mak| = n, where |x| denotes the least positive inverse image under the natural homomorphism from the additive group of integers Z onto Cn. On the other hand, we give some explicit minimal zero sequences of length [ 2 ] + 1 not having this property above.
منابع مشابه
Cyclic wavelet systems in prime dimensional linear vector spaces
Finite affine groups are given by groups of translations and di- lations on finite cyclic groups. For cyclic groups of prime order we develop a time-scale (wavelet) analysis and show that for a large class of non-zero window signals/vectors, the generated full cyclic wavelet system constitutes a frame whose canonical dual is a cyclic wavelet frame.
متن کاملFinite $p$-groups and centralizers of non-cyclic abelian subgroups
A $p$-group $G$ is called a $mathcal{CAC}$-$p$-group if $C_G(H)/H$ is cyclic for every non-cyclic abelian subgroup $H$ in $G$ with $Hnleq Z(G)$. In this paper, we give a complete classification of finite $mathcal{CAC}$-$p$-groups.
متن کاملThe Almost Sure Convergence for Weighted Sums of Linear Negatively Dependent Random Variables
In this paper, we generalize a theorem of Shao [12] by assuming that is a sequence of linear negatively dependent random variables. Also, we extend some theorems of Chao [6] and Thrum [14]. It is shown by an elementary method that for linear negatively dependent identically random variables with finite -th absolute moment the weighted sums converge to zero as where and is an array of...
متن کاملVector Spaces, Modules over Chinese Rings, and Monoids as Unions of Proper Subobjects
Given a vector space V over a field (of size at least 1), we find a sharp bound for the minimal number (or in general, indexing set) of subspaces of a fixed (finite) codimension needed to cover V . If V is a finite set, this is related to the problem of partitioning V into subspaces. We also consider the analogous problem (involving proper subobjects only) for direct sums of cyclic monoids, cyc...
متن کاملFinite groups all of whose proper centralizers are cyclic
A finite group $G$ is called a $CC$-group ($Gin CC$) if the centralizer of each noncentral element of $G$ is cyclic. In this article we determine all finite $CC$-groups.
متن کامل